Extremal problems related to convexity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal Problems in Minkowski Space Related to Minimal Networks

We solve the following problem of Z. Füredi, J. C. Lagarias and F. Morgan [FLM]: Is there an upper bound polynomial in n for the largest cardinality of a set S of unit vectors in an n-dimensional Minkowski space (or Banach space) such that the sum of any subset has norm less than 1? We prove that |S| ≤ 2n and that equality holds iff the space is linearly isometric to l ∞ , the space with an n-c...

متن کامل

Extremal Problems Related to the Sylvester–Gallai Theorem

We discuss certain extremal problems in combinatorial geometry, including Sylvester’s problem and its generalizations.

متن کامل

Davis’ Convexity Theorem and Extremal Ellipsoids

We give a variety of uniqueness results for minimal ellipsoids circumscribing and maximal ellipsoids inscribed into a convex body. Uniqueness follows from a convexity or concavity criterion on the function used to measure the size of the ellipsoid. Simple examples with non-unique minimal or maximal ellipsoids conclude this article. MSC 2000: 52A27, 52A20

متن کامل

International Health Problems Related to Alcohol Abuse

The harmful use of alcohol inflicts great deal of social and economic losses on individuals and societies. Given the increase in world population and the predicted increase in alcohol consumption, the alcohol related burden of disease progressively catches higher ranks in the list of factors threatening humans' life. It has been considered that the social and economic burden related to alcohol ...

متن کامل

Extremal Problems for Geometric Hypergraphs 1 Extremal Problems for Geometric

A geometric hypergraph H is a collection of i-dimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)-tuples of a vertex set V in general position in d-space. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and compu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Inequalities and Applications

سال: 2016

ISSN: 1029-242X

DOI: 10.1186/s13660-016-1258-y